redis source code analysis

the position pattern ++; patternLen --; if (pattern [0] = string [0]) match = 1;} else if (pattern [0] = ']') {// stop break until another brackets exist.} else if (patternLen = 0) {pat Tern --; patternLen ++; break;} else if (pattern [1] = '-' patternLen> = 3) {int start = pattern [0]; int end = pattern [2]; int c = string [0]; if (start> end) {int t = start; start = end; end = t ;} if (nocase) {start = tolower (start); end = tolower (end); c = tolower (c);} pattern + = 2; pat

* types, unsigned long * sizes) Static void findbigkeys (void)/* stats mode */static char * getinfofield (char * info, char * field) Static long getlonginfofield (char * info, char * field) void bytestohuman (char * s, long n) Static void statmode (void)/* scan mode */static void scanmode (void) /* Intrisic latency mode */unsigned long polling (void) Static void intrinsiclatencymodestop (INT s) Static void intrinsiclatencymode (void)/* Program Main () */INT main (INT argc, char ** argv)

Redis source code analysis (1) -- Redis Data Structure-string SDS, redissds 1. SDS Overview The strings used in Redis are Simple Dynamic strings (SDS. SDS is packaged Based on the C string to make it more suitable for

, set and other frequently used commands, which can be followed by multiple parameter commands, attribute command group commands, generally config get, such a single command is called a common command, Dump, Exist, and so on. There are not many CommandGroup commands as follows:/* All command groups */static char * commandGroups [] = {"generic", "string", "list", "set", "sorted_set", "hash ", "pubsub", "transactions",

The hash table is also one of the data structures supported by Redis, which uses both redis_encoding_ziplist (compressed list) and redis_encoding_ht (data Dictionary) encoding methods.When a hash table uses a compressed list, it uses the following structure to store the data (see ZIPLIST.C):+---------+------+------+------+------+------+------+------+------+---------+| ziplist | | | | | | | | | Ziplist | | ENTRY | Key1 | Val1 | Key2 | Val2 | ... | ...

) {case Redis_string:case redis_hash_zipmap:case REDIS_LIST_ZIPL Ist:case redis_set_intset:case redis_zset_ziplist:case redis_hash_ziplist://Because a struct like ziplist,zipmap is actually a node. Connected to a super string, so is directly read if (!processstringobject (NULL)) {Shift_error (offset, "ERROR reading entry value"); return 0; } break; Case Redis_list:case Redis_set://And the above 2 types are the traditional structure, to divide the node to read for (i = 0; i If the e-

object */INT latencyresetevent (char * event_to_reset)/* reset the latency of the event, delete the event record in the dictionary */void analyzelatencyforevent (char * event, struct latencystats * ls)/* analyze the delay result of the event at a certain time, the result information is stored in the latencystats structure */SDS createlatencyreport (void)/*. Based on the results of the delayed sample, the analysis report with good readability is creat

"); } server.vm_bitmap = zmalloc((server.vm_pages+7)/8); redisLog(REDIS_VERBOSE,"Allocated %lld bytes page table for %lld pages", (long long) (server.vm_pages+7)/8, server.vm_pages); memset(server.vm_bitmap,0,(server.vm_pages+7)/8); /* Initialize threaded I/O (used by Virtual Memory) */ server.io_newjobs = listCreate(); server.io_processing = listCreate(); server.io_processed = listCreate(); server.io_ready_clients = listCreate(); pthread_mutex_init(server.io

]->ptr,"no") !strcasecmp(c->argv[2]->ptr,"one")) { if (server.masterhost) { sdsfree(server.masterhost); server.masterhost = NULL; if (server.master) freeClient(server.master); server.replstate = REDIS_REPL_NONE; redisLog(REDIS_NOTICE,"MASTER MODE enabled (user request)"); } } else { sdsfree(server.masterhost); server.masterhost = sdsdup(c->argv[1]->ptr); server.masterport = atoi(c->argv[2]->ptr);

heavy IO operations, such as AoF's Fsync, calls are made by asynchronous threads, avoiding the event loops that block the main thread. The above is the Initserver function. /* Instances limited to 4GB of address space, so if there is * No explicit limit in the user provided CONFI Guration we set a limit * at 3 GB using MaxMemory with ' noeviction ' policy '. This avoids * useless crashes of the Redis instance for out of memory. * *

*/ } listAddNodeTail(c->reply,getDecodedObject(obj));}static void sendReplyToClient(aeEventLoop *el, int fd, void *privdata, int mask) { redisClient *c = privdata; int nwritten = 0, totwritten = 0, objlen; robj *o; REDIS_NOTUSED(el); REDIS_NOTUSED(mask); /* Use writev() if we have enough buffers to send */ if (!server.glueoutputbuf listLength(c->reply) > REDIS_WRITEV_THRESHOLD !(c->flags REDIS_MASTER)) { sendReplyToClientWritev(el, fd, privd

tables, both of which achieve high Memory Operation Efficiency ** Copyright (c) 2009-2010, Salvatore Sanfilippo * All rights reserved. ** Redistribution and use in source and binary forms, with or without * modification, are permitted provided that the following conditions are met: * ** Redistributions of source code must retain the above copyright notice, * thi

Today, we are analyzing the Code Implementation of the string operation class in the redis source code. With several analysis experiences, I gradually felt that I had to change the analysis method. If every API performs

Redis source code analysis () --- create and release a redisObject object, redisredisobject Today's learning efficiency is relatively high. After analyzing Rio, I learned the RedisObject file, which is about converting and creating RedisObject. Most of the methods are very similar. List the long API list: /* ---------

; /* it is now possible to unlock the background system as we know have * a stand alone job structure to process. */pthread_mutex_unlock ( bio_mutex [type]);/* process the job accordingly to its type. * // execute the specific job if (type = redis_bio_close_file) {close (long) Job-> arg1);} else if (type = redis_bio_aof_fsync) {aof_fsync (long) Job-> arg1);} else {redispanic ("wrong job type in bioprocessbackgroundjobs (). ");} zfree (job);/* lock again before reiterating the loop, if there are

Redis source code analysis (30th) --- pubsub publish and subscribe Mode Today I learned the term "Publish and subscribe mode" in Redis, which was first introduced to JMS (Java Message Service) java Message Service. I subscribe to these types of messages. Only when these type

; - Break; + } -}1.2.3 Storage space Pre-allocation　　1 SDS Sdsmakeroomfor (SDS s, size_t Addlen) {2 void*sh, *newsh;3size_t avail =Sdsavail (s);4 size_t len, Newlen;5 CharType, Oldtype = s[-1] Sds_type_mask;6 intHdrlen;7 8 /*Return ASAP If there is enough space left.*/9 if(Avail >= Addlen)returns;Ten OneLen =Sdslen (s); ASH = (Char*) ssdshdrsize (oldtype); -Newlen = (len+Addlen); - //if less than Sds_max_prealloc, the new length of the allocation is twic